#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#include "Priority_Queue.h"
int main() {
	int a[] = { 1,9,3,7,4 };
	xxx::priority_queue<int,vector<int>,Greater<int>> q(a,a+5);
	while (!q.empty()) {
		cout << q.top()<<" ";
		q.pop();
	}
	return 0;
}